k-th order symmetric SAC boolean functions and bisecting binomial coefficients
نویسندگان
چکیده
منابع مشابه
Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria
A Boolean function f satis es PC(l) of order k if f(x) f(x ) is balanced for any such that 1 W ( ) l even if any k input bits are kept constant, where W ( ) denotes the Hamming weight of . This paper shows the rst design method of such functions which provides deg(f) 3. More than that, we show how to design \balanced" such functions. High nonlinearity and large degree are also obtained. Further...
متن کاملGeneralization of Higher Order SAC to Vector Output Boolean Functions
S-boxes (vector output Boolean functions) should satisfy cryptographic criteria even if some input bits (say, k bits) are kept constant. However, this kind of security has been studied only for scalar output Boolean functions. SAC(k) is a criterion for scalar output Boolean functions of this type. This paper studies a generalization of SAC(k) to vector output Boolean functions as the rst step t...
متن کاملSIEVED PARTITION FUNCTIONS AND a-BINOMIAL COEFFICIENTS
The ^-binomial coefficient is a polynomial in q . Given an integer t and a residue class r modulo ;, a sieved ^-binomial coefficient is the sum of those terms whose exponents are congruent to r modulo /. In this paper explicit polynomial identities in q are given for sieved ij-binomial coefficients. As a limiting case, generating functions for the sieved partition function are found as multidim...
متن کاملGeneralized Factorial Functions and Binomial Coefficients
Let S ⊆ Z. The generalized factorial function for S, denoted n!S , is introduced in accordance with theory already established by Bhargava ([4]). Along with several known theorems about these functions, a number of other issues will be explored. This Thesis is divided into 4 chapters. Chapter 1 provides the necessary definitions and offers a connection between the generalized factorial function...
متن کاملSieved Partition Functions and Q-binomial Coefficients
Abstract. The q-binomial coefficient is a polynomial in q. Given an integer t and a residue class r modulo t, a sieved q-binomial coefficient is the sum of those terms whose exponents are congruent to r modulo t. In this paper explicit polynomial identities in q are given for sieved q-binomial coefficients. As a limiting case, generating functions for the sieved partition function are found as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2005
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.02.006